A tool for ramification reasoning over temporal OWL knowledge bases

نویسندگان

  • Nikos Papadakis
  • Stavros Boutzas
چکیده

In this paper we study the ramification problem in the setting of time-owl. Standard solutions from the literature on reasoning about action are inadequate because they rely on the assumption that fluents persist, and actions have effects on the next situation only. In this paper we provide a solution to the ramification problem based on an extension of the situation calculus and the work of McCain and Turner. In our approach lies the use of static and dynamic rules which capture the indirect and direct effects of actions. Also our tool has the ability to address the frame problem which refers to the identification of fluents that remain unchanged as result of actions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formalizing and Verifying Authenticity over Assertion Changes for An Interaction Protocol

The Semantic Web techniques, like OWL, bring more semantic to the static information about functionalities and non-functionalities of Web services. However, it is not smooth to faithfully describe some dynamic aspects and support reasoning tasks. When discussing the security of interactions of Web services, we should solve such problems like how to describe interactive behaviors, static informa...

متن کامل

OntoKBEval: A Support Tool for OWL Ontology Evaluation

OntoKBEval: A Support Tool for OWL Ontology Evaluation Qing Lu The Support Tool for OWL Ontology Evaluation (OntoKBEval) has been developed to apply Description Logics reasoning to ontology evaluation by deriving information from knowledge bases. The principal objective is to evaluate ontologies and to present results using a user-friendly visualized interface to users. OntoKBEval offers hierar...

متن کامل

Distributed Reasoning with EL using MapReduce

It has recently been shown that the MapReduce framework for distributed computation can be used effectively for large-scale RDF Schema reasoning, computing the deductive closure of over a billion RDF triples within a reasonable time [23]. Later work has carried this approach over to OWL Horst [22]. In this paper, we provide a MapReduce algorithm for classifying knowledge bases in the descriptio...

متن کامل

OWL2Jess: A Transformational Implementation of the OWL Semantics

The wide scale usage of OWL for the formalization of real-world ontologies is currently influenced by important limitations which concern both its expressivity and the efficiency of OWL specific reasoning tools. While the expressivity limitations may be overcame by extending the OWL language (e.g. with rules), the reasoning with such heterogeneous knowledge bases is still an open issue. In this...

متن کامل

Reasoning over Dynamic Data in Expressive Knowledge Bases with Rscale

We introduce Rscale, a secondary storage-aware OWL 2 RL reasoning system capable of dealing with incremental additions and deletions of facts. Our initial evaluation indicates that Rscale is suitable for stream reasoning scenarios characterized by expressive reasoning tasks triggered by a moderate change frequency.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • KES Journal

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2010